package com.zjj.algorithm.learning.niuke;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 * @author zjj_admin
 * @date 2023/2/10 19:52
 */
public class Exam1 {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        String s = scanner.nextLine();
        String[] split = s.split(",");
        int aTime = Integer.parseInt(split[0]);
        int bTime = Integer.parseInt(split[1]);
        int max = Math.max(aTime,bTime);
        int time1,time2;
        if(aTime == max){
            time1 = bTime;
            time2 = aTime;
        }else {
            time1 = aTime;
            time2 = bTime;
        }
        int count = Integer.parseInt(split[2]);
        List<Integer> res = new ArrayList<>();
        int a = count;
        int num;
        while (a >= 0){
            num = a * time1 + (count - a ) * time2;
            a--;
            res.add(num);
        }
        System.out.println(res);

    }
}
